A Specht Module Analog for the Rook Monoid

نویسنده

  • Cheryl Grood
چکیده

The wealth of beautiful combinatorics that arise in the representation theory of the symmetric group is well-known. In this paper, we analyze the representations of a related algebraic structure called the rook monoid from a combinatorial angle. In particular, we give a combinatorial construction of the irreducible representations of the rook monoid. Since the rook monoid contains the symmetric group, it is perhaps not surprising that the construction outlined in this paper is very similar to the classic combinatorial construction of the irreducible Sn-representations: namely, the Specht modules.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniserial modules of generalized power series

Let R be a ring, M a right R-module and (S,≤) a strictly ordered monoid. In this paper we will show that if (S,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ S, then the module [[MS,≤]] of generalized power series is a uniserial right [[RS,≤]] ]]-module if and only if M is a simple right R-module and S is a chain monoid.

متن کامل

Representation theory of q-rook monoid algebras

We show that, over an arbitrary field, q-rook monoid algebras are iterated inflations of Iwahori-Hecke algebras, and, in particular, are cellular. Furthermore we give an algebra decomposition which shows a q-rook monoid algebra is Morita equivalent to a direct sum of Iwahori-Hecke algebras. We state some of the consequences for the representation theory of q-rook monoid algebras.

متن کامل

Pattern Avoidance in the Rook Monoid

We consider two types of pattern avoidance in the rook monoid, i.e. the set of 0–1 square matrices with at most one nonzero entry in each row and each column. For one-dimensional rook patterns, we completely characterize monoid elements avoiding a single pattern of length at most three and develop an enumeration scheme algorithm to study rook placements avoiding sets of patterns.

متن کامل

Gelfand Models for Diagram Algebras : extended abstract

A Gelfand model for a semisimple algebra A over C is a complex linear representation that contains each irreducible representation of A with multiplicity exactly one. We give a method of constructing these models that works uniformly for a large class of combinatorial diagram algebras including: the partition, Brauer, rook monoid, rook-Brauer, Temperley-Lieb, Motzkin, and planar rook monoid alg...

متن کامل

Fast Fourier Transforms for the Rook Monoid

We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divideand-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks the first extension of group FFTs to non-group semigroups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2002